Lexicographical Order
نویسندگان
چکیده
procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, repeated multiplication, is done, raising b to the power c. Beyond these the question of grouping is important . The innermost implied parentheses are at the right. The hyper-exponent is always c. For op = 4 te t ra t ion, repeated exponentiat ion, is done. For op = 5, 6, 7, etc., the procedure performs pentat ion, hexation, heptat ion, etc., respectively. The routine was originally programmed in FORTRAN for the Control Data 160 desk-size computer. The original program was limited to te t ra t ion because subroutine recursiveness in Control Data 160 FORTRAN has been held down to four levels in the interests of economy. The input parameter , b, c, and op, must be positive integers, not zero; b e g i n own i n t e g e r d, e, f, drop; i f o p = 1 t h e n b e g i n a := h-4c; go t o l e n d i f o p = 2 t h e n d := 0; else d := 1; e := c; drop := op 1; for f := I s t e p 1 u n t i l e do b e g i n ari thmetic (a, b, d, drop);
منابع مشابه
Lexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملTwo variable orthogonal polynomials and structured matrices
We consider bivariate real valued polynomials orthogonal with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between polynomials of different degrees. These formulas link the orthogonal polynomials constructed using the lexicographical ordering with those constructed using the re...
متن کاملReflections on Lexicographical User Research*
The last decades have seen a growing interest in theoretical and practical problems related to lexicographical user research. Starting with a discussion of the concept of lexicographically relevant user needs, this contribution analyses, utilising the lexicographical function theory, various types of needs to be taken into account when doing this kind of research. It then discusses the positive...
متن کاملAlgorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended)
It is natural to relate partially ordered sets (posets in short) and classes of equivalent words over partially commutative alphabets. Their common graphical representation are Hasse diagrams. We investigate this relation in detail and propose an efficient online algorithm that decompresses a concurrent word to its Hasse diagram. The lexicographically minimal representative of a trace (an equiv...
متن کاملYalta Conference on Discrete and Global Optimization
s of the Talks Sorted in alphabetical order of the first author’s last name Titles of poster presentations are marked with ∗ Attainability of Optimal Solutions of Lexicographical Maximization Problem with Convex Criterion Functions on their Weighed Sum∗
متن کاملA Modification on the Hesitant Fuzzy Set Lexicographical Ranking Method
Recently, a novel hesitant fuzzy set (HFS) ranking technique based on the idea of lexicographical ordering is proposed and an example is presented to demonstrate that the proposed ranking method is invariant with multiple occurrences of any element of a hesitant fuzzy element (HFE). In this paper, we show by examples that the HFS lexicographical ordering method is sometimes invalid, and a modif...
متن کامل